A MAX-MIN Ant System for the University Course Timetabling Problem
نویسندگان
چکیده
We consider a simplification of a typical university course timetabling problem involving three types of hard and three types of soft constraints. A MAX -MIN Ant System, which makes use of a separate local search routine, is proposed for tackling this problem. We devise an appropriate construction graph and pheromone matrix representation after considering alternatives. The resulting algorithm is tested over a set of eleven instances from three classes of the problem. The results demonstrate that the ant system is able to construct significantly better timetables than an algorithm that iterates the local search procedure from random starting solutions.
منابع مشابه
Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art
Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented – Ant Colony System and MAX -MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine (or neighborhood definition), and a refe...
متن کاملSolving the University Course Timetabling Problem by Hypercube Framework for ACO
We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restr...
متن کاملUniversity Course Timetabling Using ACO: A Case Study on Laboratory Exercises
The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present t...
متن کاملThe Influence of Run-Time Limits on Choosing Ant System Parameters
The influence of the allowed running time on the choice of the parameters of an ant system is investigated. It is shown that different parameter values appear to be optimal depending on the algorithm run-time. The performance of the MAX -MIN Ant System (MMAS) on the University Course Timetabling Problem (UCTP) – a type of constraint satisfaction problem – is used as an example. The parameters t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002